Global Optimization of Multivariate Holderian Functions Using Overestimators
نویسندگان
چکیده
منابع مشابه
Global Optimization of Rational Multivariate Functions
The paper deals with unconstrained global minimization of rational functions. A necessary condition is given for the function to have a nite innmum. In case the condition is satissed, the problem is shown to be equivalent to a speciic constrained polynomial optimization problem. In this paper, we solve a relaxation of the latter formulation using semi-deenite programming. In general, the relaxa...
متن کاملTowards Optimal Compression of Meteorological Data: A Case Study of Using Interval-Motivated Overestimators in Global Optimization
The existing image and data compression techniques try to minimize the mean square deviation between the original data f(x, y, z) and the compresseddecompressed data f̃(x, y, z). In many practical situations, reconstruction that only guaranteed mean square error over the data set is unacceptable. For example, if we use the meteorological data to plan a best trajectory for a plane, then what we r...
متن کاملGlobal optimization of Lipschitz functions
The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for their performance. We introduce and analyze a first algorithm called LIPO wh...
متن کاملThe cluster problem in multivariate global optimization
We consider branch and bound methods for enclosing all unconstrained global minimizers of a nonconvex nonlinear twice-continuously differentiable objective function. In particular, we consider bounds obtained with interval arithmetic, with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undes...
متن کاملEmpirical review of standard benchmark functions using evolutionary global optimization
We have employed a recent implementation of genetic algorithms to study a range of standard benchmark functions for global optimization. It turns out that some of them are not very useful as challenging test functions, since they neither allow for a discrimination between different variants of genetic operators nor exhibit a dimensionality scaling resembling that of real-world problems, for exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OALib
سال: 2017
ISSN: 2333-9721,2333-9705
DOI: 10.4236/oalib.1103511